The Conway–Sloane tetralattice pairs are non-isometric
نویسندگان
چکیده
منابع مشابه
Non-Rigid Registration Under Isometric Deformations
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimization problem and solves it by alternating between correspondence and deformation optimization. Assuming approximately isometric deformations, robust correspondences are generated using a pruning mechanism based on geod...
متن کاملStable Region Correspondences Between Non-Isometric Shapes
We consider the problem of finding meaningful correspondences between 3D models that are related but not necessarily very similar. When the shapes are quite different, a point-to-point map is not always appropriate, so our focus in this paper is a method to build a set of correspondences between shape regions or parts. The proposed approach exploits a variety of feature functions on the shapes ...
متن کاملDistal and non-distal Pairs
The aim of this note is to determine whether certain non-o-minimal expansions of o-minimal theories which are known to be NIP, are also distal. We observe that while tame pairs of o-minimal structures and the real field with a discrete multiplicative subgroup have distal theories, dense pairs of o-minimal structures and related examples do not.
متن کامل(Non)native Language Teachers’ Cognitions: Are They Dichotomous?
In view of native/nonnative language teacher dichotomy, different characteristics have been assigned to these 2 groups. The dichotomy has been the source of different actions and measures to clarify the positive and negative points of being (non)native teachers. In recent years, many researchers have revisited this dichotomy. The challenge to the dichotomy can be a source of motivation to explo...
متن کاملUniversally Elevating the Phase Transition Performance of Compressed Sensing: Non-Isometric Matrices are Not Necessarily Bad Matrices
In compressed sensing problems, l1 minimization or Basis Pursuit was known to have the best provable phase transition performance of recoverable sparsity among polynomialtime algorithms. It is of great theoretical and practical interest to find alternative polynomial-time algorithms which perform better than l1 minimization. [20], [21], [22] and [23] have shown that a two-stage re-weighted l1 m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2011
ISSN: 0001-8708
DOI: 10.1016/j.aim.2011.05.016